A multiscale sub-linear time Fourier algorithm for noisy data
نویسندگان
چکیده
منابع مشابه
A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data
We extend the recent sparse Fourier transform algorithm of [1] to the noisy setting, in which a signal of bandwidth N is given as a superposition of k N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the β-encoders in analog-to-digital conversion [2]. The algorithm runs ...
متن کاملComparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems
Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...
متن کاملAdaptive sub-linear Fourier algorithms
We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k N significant Fourier coefficients from a signal of bandwidth N . Previous deterministic algorithms exhibit quadratic runtime scaling, while our algorithm scales linearly with k in the average case. Underlying our algorithm are a few simple observations relating the Fourier coeffici...
متن کاملSub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach
We consider the problem of querying a string (or, a database) of length N bits to determine all the locations where a substring (query) of length M appears either exactly or is within a Hamming distance of K from the query. We assume that sketches of the original signal can be computed off line and stored. Using the sparse Fourier transform computation based approach introduced by Pawar and Ram...
متن کاملA Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators
This paper presents an efficient multiscale butterfly algorithm for computing Fourier integral operators (FIOs) of the form (Lf)(x) = ∫ Rd a(x, ξ)e f̂(ξ)dξ, where Φ(x, ξ) is a phase function, a(x, ξ) is an amplitude function, and f(x) is a given input. The frequency domain is hierarchically decomposed into a union of Cartesian coronas. The integral kernel a(x, ξ)e in each corona satisfies a spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2016
ISSN: 1063-5203
DOI: 10.1016/j.acha.2015.04.002